Branch-and-bound processing of ranked queries
نویسندگان
چکیده
منابع مشابه
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In this paper, we propose a simple yet powerful technique for processing such queries based on multidimensional access methods and branch-and-bound search. The advantages of the proposed methodology are: (i) it is space e...
متن کاملProcessing Ranked Queries with the Minimum Space
Practical applications often need to rank multi-variate records by assigning various priorities to different attributes. Consider a relation that stores students’ grades on two courses: database and algorithm. Student performance is evaluated by an “overall score” calculated as w1 ·gdb+w2 ·galg , where w1, w2 are two input “weights”, and gdb (galg) is the student grade on database (algorithm). ...
متن کاملEfficient Processing of Ranked Queries with Sweeping Selection
Existing methods for top-k ranked query employ techniques including sorting, updating thresholds and materializing views. In this paper, we propose two novel index-based techniques for top-k ranked query: (1) indexing the layered skyline, and (2) indexing microclusters of objects into a grid structure. We also develop efficient algorithms for ranked query by locating the answer points during th...
متن کاملSupporting Ranked Boolean Similarity Queries in MARS
To address the emerging needs of applications that require access to and retrieval of multimedia objects we are developing the Multimedia Analysis and Retrieval System MARS in our group at the University of Illinois In this paper we concentrate on the retrieval subsystem of MARS and its support for content based queries over image databases Content based retrieval techniques have been extensive...
متن کاملRanked Queries in Index Data Structures
A ranked query is a query which returns the top-ranking elements of a set, sorted by rank, where the rank corresponds to some sort of preference function defined on the items of the set. This thesis investigates the problem of adding rank query capabilities to several index data structures on top of their existing functionality. Among the data structures investigated are suffix trees, range tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 2007
ISSN: 0306-4379
DOI: 10.1016/j.is.2005.12.001